The VPN Problem with Concave Costs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The VPN Problem with Concave Costs

Only recently Goyal, Olver and Shepherd (Proc. STOC, 2008) proved that the symmetric Virtual Private Network Design (sVPN) problem has the tree routing property, namely, that there always exists an optimal solution to the problem whose support is a tree. Combining this with previous results by Fingerhut, Suri and Turner (J. Alg., 1997) and Gupta, Kleinberg, Kumar, Rastogi and Yener (Proc. STOC,...

متن کامل

The p-Median Problem with Concave Costs

The p-median problem has been widely studied in the literature during the last decades especially its linear version. We propose a capacitated p-median problem with concave costs, in which the global cost incurred for each established facility is a concave function of the quantity q delivered by this facility. The unit distribution cost decreases with the increased quantity of output or demand ...

متن کامل

Network Optimization with Concave Costs

In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.

متن کامل

Network Optimization with Concave Costs

In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.

متن کامل

The Virtual Private Network Design Problem with Concave Costs

The symmetric Virtual Private Network Design (VPND) problem is concerned with buying capacity on links (edges) in a communication network such that certain traffic demands can be met. The precise definition is below. It was shown by Fingerhut, Suri and Turner [3] and later, independently, by Gupta, Kleinberg, Kumar, Rastogi and Yener [8] that VPND can be solved in polynomial time if it has the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Discrete Mathematics

سال: 2010

ISSN: 0895-4801,1095-7146

DOI: 10.1137/090749700